Enhancement of fuzzy clustering by mechanisms of partial supervision
نویسندگان
چکیده
Semi-supervised (or partial) fuzzy clustering plays an important and unique role in discovering hidden structure in data realized in presence of a certain quite limited fraction of labeled patterns. The objective of this study is to investigate and quantify the effect of various distance functions (distances) on the performance of the clustering mechanisms. The underlying goal of endowing the clustering algorithms with a higher level of flexibility is done via the use of various distances. The enhancement of this character is evaluated by means of a comprehensive assessment of quality of clusters, their ensuing discrimination abilities and the accuracy of clusters themselves. In addition to the standard Euclidean distance being commonly exploited in fuzzy clustering, three more versatile and adaptive distance measures are considered such as its weighted version, a full adaptive distance, and a kernel-based distance. Using Fuzzy C-Means (FCM) coming in its generic format, we show its semi-supervised enhancements, derive detailed formulas and analyze their effectiveness. The improvements of semi-supervised clustering are empirically evaluated and numerically quantified with the use of several Machine Learning data sets. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Fuzzy Objective Function-Based Technique of Partial Supervision for a Heuristic Method of Possibilistic Clustering
The paper presents a technique of constructing of a set of labeled objects for using in a heuristic method of possibilistic clustering with partial supervision. The technique is based on the data preprocessing using fuzzy objective function-based clustering procedures. An illustrative example of the technique using and partial supervised method’s application to the Sneath and Sokal’s two-dimens...
متن کاملA Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملFuzzy clustering with partial supervision
Presented here is a problem of fuzzy clustering with partial supervision, i.e., unsupervised learning completed in the presence of some labeled patterns. The classification information is incorporated additively as a part of an objective function utilized in the standard FUZZY ISODATA. The algorithms proposed in the paper embrace two specific learning scenarios of complete and incomplete class ...
متن کاملRough Clustering with Partial Supervision
This study focuses on bringing two rough-set-based clustering algorithms into the framework of partially supervised clustering. A mechanism of partial supervision relying on either fuzzy membership grades or rough memberships and non-memberships of patterns to clusters is envisioned. Allowing such knowledgebased hints to play an active role in the discovery of the overall structure of the datas...
متن کاملShape Retrieval by Partially Supervised Fuzzy Clustering
In this work we propose the use of partially supervised fuzzy clustering to create a two-level indexing structure useful for enabling efficient shape retrieval. Similar shapes are grouped by a fuzzy clustering algorithm that embeds a partial supervision mechanism exploiting domain knowledge expressed in terms of a set of labeled shapes. After clustering, a set of prototypes representative of sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fuzzy Sets and Systems
دوره 157 شماره
صفحات -
تاریخ انتشار 2006